A covering problem over finite rings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Equivalence Problem over Finite Rings

We investigate the computational complexity of deciding whether or not a given polynomial , presented as the sum of monomials, is identically 0 over a ring. It is proved that if the factor by the Jacobson-radical is not commutative, then the problem is coNP-complete.

متن کامل

The Covering Problem for Chinese Rings

Given a direct sum G of cyclic groups, we find a sharp bound for the minimal number of proper subgroups whose union is G. This generalizes to sums of cyclic modules over more general rings, and we are able to solve this covering problem for all local, Artinian, or Dedekind rings (and even for monoids). We also minimally cover all finitely generated non-cyclic modules over quasi-local rings. The...

متن کامل

Triangularization over finite-dimensional division rings using the reduced trace

In this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. First, we give a generalization of Guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. The first one...

متن کامل

Cyclic codes over finite rings

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...

متن کامل

Linear Codes over Finite Rings

Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2010

ISSN: 0893-9659

DOI: 10.1016/j.aml.2009.09.022